One-way communication complexity of symmetric Boolean functions
نویسندگان
چکیده
منابع مشابه
One-Way Communication Complexity of Symmetric Boolean Functions
We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction...
متن کاملTight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models
We study the communication complexity of symmetric XOR functions, namely functions f : {0, 1}×{0, 1} → {0, 1} that can be formulated as f(x, y) = D(|x⊕ y|) for some predicate D : {0, 1, ..., n} → {0, 1}, where |x⊕ y| is the Hamming weight of the bitwise XOR of x and y. We give a public-coin randomized protocol in the Simultaneous Message Passing (SMP) model, with the communication cost matching...
متن کاملUnbounded-Error Communication Complexity of Symmetric Functions
The sign-rank of a real matrix M is the least rank of a matrix R in which every entry has the same sign as the corresponding entry of M.We determine the sign-rank of every matrix of the form M = [ D(|x ∧ y|) ]x,y, where D : {0, 1, . . . , n} → {−1,+1} is given and x and y range over {0, 1}n . Specifically, we prove that the sign-rank of M equals 22̃(k), where k is the number of times D changes s...
متن کاملExponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function
We give an exponential separation between one-way quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently by Kerenidis and Raz [KR06]. Our version of the result gives an example in the bounded storage model of cryptography, where the key is secure if the adversary...
متن کاملThe one-way communication complexity of the Boolean Hidden Matching Problem
We give a tight lower bound of Ω( √ n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communication complexity protocol of O(log n) qubits for this problem, we obtain an exponential separation of quantum and classical one-way communication complexity for partial functions. A similar result was independently ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2005
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:2005037